Comparing Vectorization Techniques for Triangular Matrix Decomposition Computations
نویسندگان
چکیده
In this work we present a study on the vectorization of code segments that are typical for solving linear equation systems. We have selected Gaussian Elimination as representative of this type of problems. The sequential algorithm that performs this computation has a main loop with three nesting levels (indices i, j and k), that can be arranged according to six diierent organizations (called ijk forms). Out of these forms we chose the two most frequently used, which are, the kij form (or LU algorithm) and the jik form (or Crout algorithm) 2, 3].
منابع مشابه
DECOMPOSITION METHOD FOR SOLVING FULLY FUZZY LINEAR SYSTEMS
In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. This paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix S and a fuzzy triangular matrix T.
متن کاملEvaluating Block Algorithm Variants in LAPACK
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1, 2, and 3 BLAS to carry out basic operations. A principal focus of this project is to implement blocked versions of a number of algorithms to take advantage of the greater parallelism and improved data locality of th...
متن کاملQR Decomposition
In this work we present a formalization of the QR decomposition, an algorithm which decomposes a real matrix A in the product of another two matrices Q and R, where Q is an orthogonal matrix and R is invertible and upper triangular. The algorithm is useful for the least squares problem, i.e. the computation of the best approximation of an unsolvable system of linear equations. As a side-product...
متن کاملMatrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation
Matrix multiplication (hereafter we use the acronym MM) is among the most fundamental operations of modern computations. The efficiency of its performance depends on various factors, in particular vectorization, data movement and arithmetic complexity of the computations, but here we focus just on the study of the arithmetic cost and the impact of this study on other areas of modern computing. ...
متن کاملA stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کامل